Arithmetic theories for computational complexity problems
نویسندگان
چکیده
منابع مشابه
Weak Theories of Arithmetic for Computational Complexity: A Gentle Introduction
In this talk we will discuss about proof-theoretic approaches to computational complexity in terms of weak theories of arithmetic as known as theories of bounded arithmetic, which was initiated by Samuel Buss. We will start with classical facts on primitive recursive functions, and then go into discussion about polynomial time functions and polynomial space functions, including a recent challen...
متن کاملComputational Complexity Analyses of Modular Arithmetic for RSA Cryptosystem
Modular arithmetic is fundamental to several public-key cryptography systems such as the RSA encryption system, as well as the most dominant part of the computation performed. The operation is time-consuming for large operands. Many relevant papers about computer security are issued in many reports and journals to describe how to reduce the computational complexities in the cryptosystems. In th...
متن کاملOn sample complexity for computational classification problems
1 In the statistical setting of the classification (pattern recognition) problem the number of examples required to approximate an unknown labelling function is linear in the VC dimension of the target learning class. In this work we consider the question of whether such bounds exist if we restrict our attention to computable classification methods, assuming that the unknown labelling function ...
متن کاملFinitely unstable theories and computational complexity
The complexity class NP can be logically characterized both through existential second order logic SO∃, as proven by Fagin, and through simulating a Turing machine via the satisfiability problem of propositional logic SAT, as proven by Cook. Both theorems involve encoding a Turing machine by a formula in the corresponding logic and stating that a model of this formula exists if and only if the ...
متن کاملWeak applicative theories , truth , and computational complexity
The aim of our thesis is the design of applicative theories on words of strength below Primitive Recursive Arithmetic to give implicit characterisations of complexity classes in the style of Strahm’s [79]. In more detail, we analyse the effect of adding second-order notions as types or truth to an applicative base theory, and obtain theories of great expressive power, but still polynomial stren...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Information and Control
سال: 1986
ISSN: 0019-9958
DOI: 10.1016/s0019-9958(86)80041-9